1 Penalty Search
ثبت نشده
چکیده
This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search has been extended by the idea of reactive search, which is based on a "reactive" mechanism for the determination of search parameters. In reactive penalty search penalty parameters are determined and readjusted considering the past behavior of the search process.
منابع مشابه
1 1 Penalty Search
This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search ...
متن کاملA Penalty Line Search Method with Steering Rules
In this paper an exact penalty line search is introduced for solving constrained nonlinear programing. By this method it is possible to solve some problems with combining penalty method and SQP method, and in any iteration for producing new stepone can uses linear search and solves unconstrained optimization by exact penalty function. In this method a linear programming subproblem with trust ar...
متن کاملAdmissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines
Many efficient implementations of Al search algorithms have been realized in recent years. In an effort to widen the area of application of search methods to problems that arise in industry, this paper examines the role that search can play in solving certain types of hard optimization problems that involve the proper sequencing of jobs in one-machine job-shops and two-machine flow-shops. The p...
متن کاملAdaptive Penalty Function for Solving Constrained Evolutionary Optimization
A criticism of Evolutionary Algorithms might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search problems is to use penalty methods, because of their simplicity and ease of implementation. The penalty function approach is generic and applicable to any type of constraint (linear or nonlinear). Nonetheless, the most diffic...
متن کاملA hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks
In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...
متن کامل